Proof that Enhanced Pyramid Networks are 2-Edge-Hamiltonicity
نویسندگان
چکیده
The pyramid network is a hierarchy structure based on meshes. Chen et al. in 2004 proposed a new hierarchy structure, called the enhanced pyramid network, by replacing each mesh at layer greater than one of the pyramid network with a torus. This investigation demonstrates that the enhanced pyramid network with two faulty edges is Hamiltonian. The result is optimal because both edge connectivity and node connectivity of the enhanced pyramid network are four.
منابع مشابه
An Embedding of Multiple Edge-Disjoint Hamiltonian Cycles on Enhanced Pyramid Graphs
The enhanced pyramid graph was recently proposed as an interconnection network model in parallel processing for maximizing regularity in pyramid networks. We prove that there are two edge-disjoint Hamiltonian cycles in the enhanced pyramid networks. This investigation demonstrates its superior property in edge fault tolerance. This result is optimal in the sense that the minimum degree of the g...
متن کاملHamiltonicity of the Pyramid Network with or without Fault
Sarbazi-Azad, Ould-Khaoua, and Mackenzie proved in 2001 that there exists a Hamiltonian cycle in a pyramid network and they also constructed a Hamiltonian path between apex and each of 4 frontiers of a pyramid network. The fault tolerance is a crucial matter for parallel computing, especially in a large network. This work improves Sarbazi-Azad et al.’s result and considers other relative proble...
متن کاملOn the Fault Tolerance and Hamiltonicity of the Optical Transpose Interconnection System of Non-Hamiltonian Base Graphs
Hamiltonicity is an important property in parallel and distributed computation. Existence of Hamiltonian cycle allows efficient emulation of distributed algorithms on a network wherever such algorithm exists for linear-array and ring, and can ensure deadlock freedom in some routing algorithms in hierarchical interconnection networks. Hamiltonicity can also be used for construction of independen...
متن کاملEdge-tenacity in Networks
Numerous networks as, for example, road networks, electrical networks and communication networks can be modeled by a graph. Many attempts have been made to determine how well such a network is "connected" or stated differently how much effort is required to break down communication in the system between at least some nodes. Two well-known measures that indicate how "reliable" a graph is are the...
متن کاملNatural scene text localization using edge color signature
Localizing text regions in images taken from natural scenes is one of the challenging problems dueto variations in font, size, color and orientation of text. In this paper, we introduce a new concept socalled Edge Color Signature for localizing text regions in an image. This method is able to localizeboth Farsi and English texts. In the proposed method rst a pyramid using diff...
متن کامل